Product Variety, Sourcing Complexity, and the Bottleneck of Coordination

نویسندگان

  • Yue Maggie Zhou
  • Stephen M. Ross
  • Xiang Wan
چکیده

Research summary: This paper studies the coordination burden for firms that pursue variety as their main product strategy. We propose that product variety magnifies the tension between scale economies in production and scope economies in distribution, giving rise to complex sourcing relationships. Sourcing complexity worsens performance and poses a dilemma for organization design: A hierarchical structure with intermediate coordinating units such as sourcing hubs reduces sourcing complexity for downstream distribution but creates bottlenecks at the hubs, hurting performance for both the hubs and downstream distribution. We empirically examine operations data for about 300 distribution centers within a major soft drink bottling company in 2010–2011. Results support our hypotheses, illuminating the source of complexity in multiproduct firms and the challenge for organization design in managing complexity. Managerial summary: This paper uses data for about 300 distribution centers within a major soft drink bottling company to study how a large product variety creates complex sourcing networks. We find that, in addition to poor performance (e.g., increased stockouts), complex sourcing networks can cause challenges for organization design. In particular, the benefits of converting an existing distribution center into a sourcing hub (i.e., reduction in sourcing complexity for downstream distribution) and the costs of doing so (i.e., reduction in performance for both the hubs and downstream distribution) are both real and significant. The design of an efficient sourcing network despite its complexity involves important managerial decisions. Experiences in building and managing such networks can be the basis of a dynamic capability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fuzzy Clustering of Job Occupations in National Iranian South Oil Company; Strategic Sourcing in Talent Supply Chain Management

Talent management is one of the most important challenges faced by management of companies. Uncertainty in predicting competencies that are critical for companies and the inability to accurately estimate the voluntary of talents turnover, has required adapting concepts from the supply chain management, such as supply and strategic sourcing in talent management. The purpose of this research was ...

متن کامل

On Bottleneck Product Rate Variation Problem with Batching

The product rate variation problem minimizes the variation in the rate at which different models of a common base product are produced on the assembly lines with the assumption of negligible switch-over cost and unit processing time for each copy of each model. The assumption of significant setup and arbitrary processing times forces the problem to be a two phase problem. The first phase determ...

متن کامل

A new heuristic approach to solve product mix problems in a multi-bottleneck system

Product mix problem (PMP) is one of the most important and complicated problems in production systems. Different approaches have been applied to solve this problem, among them, theory of constraints (TOC) has been widely considered since 1990s. This paper develops a distinguished algorithm to solve product mix prob-lems that is efficient both in single and multi-bottleneck problems. At first, t...

متن کامل

Solving product mix problem in multiple constraints environment using goal programming

The theory of constraints is an approach to production planning and control that emphasizes on the constraints to increase throughput by effectively managing constraint resources. One application in theory of constraints is product mix decision. Product mix influences the performance measures in multi-product manufacturing system. This paper presents an alternative approach by using of goal pro...

متن کامل

On the inverse maximum perfect matching problem under the bottleneck-type Hamming distance

Given an undirected network G(V,A,c) and a perfect matching M of G, the inverse maximum perfect matching problem consists of modifying minimally the elements of c so that M becomes a maximum perfect matching with respect to the modified vector. In this article, we consider the inverse problem when the modifications are measured by the weighted bottleneck-type Hamming distance. We propose an alg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016